A cyclic block coordinate descent method with generalized gradient projections
نویسندگان
چکیده
منابع مشابه
Block-Cyclic Stochastic Coordinate Descent for Deep Neural Networks
We present a stochastic first-order optimization algorithm, named BCSC, that adds a cyclic constraint to stochastic block-coordinate descent. It uses different subsets of the data to update different subsets of the parameters, thus limiting the detrimental effect of outliers in the training set. Empirical tests in benchmark datasets show that our algorithm outperforms state-of-the-art optimizat...
متن کاملRobust Block Coordinate Descent
In this paper we present a novel randomized block coordinate descent method for the minimization of a convex composite objective function. The method uses (approximate) partial second-order (curvature) information, so that the algorithm performance is more robust when applied to highly nonseparable or ill conditioned problems. We call the method Robust Coordinate Descent (RCD). At each iteratio...
متن کاملA block coordinate gradient descent method for regularized convex separable optimization and covariance selection
We consider a class of unconstrained nonsmooth convex optimization problems, in which the objective function is the sum of a convex smooth function on an open subset of matrices and a separable convex function on a set of matrices. This problem includes the covariance selection estimation problem that can be expressed as an `1-penalized maximum likelihood estimation problem. In this paper, we p...
متن کاملA Coordinate Gradient Descent Method for Nonsmooth Nonseparable Minimization
This paper presents a coordinate gradient descent approach for minimizing the sum of a smooth function and a nonseparable convex function. We find a search direction by solving a subproblem obtained by a second-order approximation of the smooth function and adding a separable convex function. Under a local Lipschitzian error bound assumption, we show that the algorithm possesses global and loca...
متن کاملA coordinate gradient descent method for nonsmooth separable minimization
This is a talk given at ISMP, Jul 31 2006.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2016
ISSN: 0096-3003
DOI: 10.1016/j.amc.2016.04.031